An Efficient Software Defect Prediction Model Using Optimized Tabu Search Branch and Bound Procedure

نویسنده

  • P. Krishnakumari
چکیده

Software fault localization is considered to be one of the most tedious procedures that involves larger amount of time during the debugging of program. With this, there arises an increasing desire for software fault localization to be practiced with minimum amount of human intervention. This resulted with the design of several methods, each of which provides means to address the issues related to software fault localization to be more significant in its own notable and innovative manner. While the automatic structure based fault localization using genetic programming retains the program by avoiding a specific error, but failed to repair new types of bugs and programs. Most of the present software fault localization method overcomes the individual software failures and faults. However, an in-depth insight into the work reveals that, localization does not support several combinations of heuristics faults while performing software component testing. Finally, high automatic fault localization demand led to the proposal and development of software functionality on predicting the faults at an earlier stage with minimal prediction time. To overcome the defect on software fault localization, Tabu Search Fault Localization with Path Branch and Bound procedure on Software Engineering (TSFL-PBB) is proposed in this paper. TSFL-PBB divides the work into two phases. The first phase identifies (i.e.,) search doubtful software programming code which contain bugs (i.e.,) faults using Meta-heuristic Tabu search method. The mathematical operational based optimization checks with the immediate neighbors to handle different combinations of heuristics faults. The second phase of the TSFL-PBB software engineering model develops the Path Branch and Bound procedure. The branch and bound procedure in TSFL-PBB uses the travelling salesperson operation on localizing the faults at a faster prediction rate with higher readability and maintainability of software quality. Experiment is performed on factors such as fault prediction rate, processing time, repair cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...

متن کامل

Parametric tabu-search for mixed integer programs

Aparametric form of tabu-search is proposed for solvingmixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Manag...

متن کامل

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem

Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we  optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015